A Catalogue of the Steiner Triple Systems of Order 19
نویسندگان
چکیده
A method for compressing Steiner triple systems is presented. This method has been used to compress the 11,084,874,829 Steiner triple systems of order 19 into approximately 39 gigabytes of memory. The compressed data can be obtained by contacting the authors.
منابع مشابه
Steiner Triple Systems of Order 19 with Nontrivial Automorphism Group
There are 172,248 Steiner triple systems of order 19 having a nontrivial automorphism group. Computational methods suitable for generating these designs are developed. The use of tactical configurations in conjunction with orderly algorithms underlies practical techniques for the generation of the designs, and the subexponential time isomorphism technique for triple systems is improved in pract...
متن کاملSteiner Triple Systems of Order 19 Contain a Subsystem of Order
In this paper, we enumerate the (nonisomorphic) Steiner triple systems of order 19 which contain a subsystem of order 9. The number of these designs is precisely 284457. We also determine which of these designs also contain at least one subsystem of order 7, and how many. Exactly 13529 of them contain at least one subsystem of order 7.
متن کاملThe embedding problem for partial Steiner triple systems
The system has the nice property that any pair of distinct elements of V occurs in exactly one of the subsets. This makes it an example of a Steiner triple system. Steiner triple systems first appeared in the mathematical literature in the mid-nineteenth century but the concept must surely have been thought of long before then. An excellent historical introduction appears in [7]. As pointed out...
متن کاملThe Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected
Switching is a local transformation that when applied to a combinatorial object gives another object with the same parameters. It is here shown that the cycle switching graph of the 11 084 874 829 isomorphism classes of Steiner triple systems of order 19 as well as the cycle switching graph of the 1 348 410 350 618 155 344 199 680 000 labeled such designs are connected. In addition to giving an...
متن کاملSets of three pairwise orthogonal Steiner triple systems
Two Steiner triple systems (STS) are orthogonal if their sets of triples are disjoint, and two disjoint pairs of points defining intersecting triples in one system fail to do so in the other. In 1994, it was shown [2] that there exist a pair of orthogonal Steiner triple systems of order v for all v ≡ 1, 3 (mod 6), with v ≥ 7, v 6= 9. In this paper we show that there exist three pairwise orthogo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008